Technical Note—Optimal Pole-Vaulting Strategy

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Character Inverted Pendulum: Pogo-Sticks, Pole-Vaulting, and Dynamic Stepping

This article gives a practical overview of the popular biomechanically inspired, computationally efficient, algorithmically straightforward inverted pendulum technique for character-based systems. We explain the different flavours of inverted pendulum (e.g., springloaded and gravity compensated inverted pendulum), their viability for different situations (e.g., walking, running), simulation res...

متن کامل

Integrating ODE's in the Complex Plane-Pole Vaulting

Most existing algorithms for solving initial value problems in ordinary differential equations implicitly assume that all variables are real. If the real-valued assumption is removed, the solution can be extended by analytic continuation along a path of integration in the complex plane of the independent variable. This path is chosen to avoid singularities which can make the solution difficult ...

متن کامل

Optimizing the Pole Properties in Pole Vaulting by Using Genetic Algorithm Based on Frequency Analysis

The pole vaulting is a sport with a long history involving complex dynamic motion. The aim of pole vaulting for the athlete is to achieve maximum height. The dynamic behavior of the pole-athlete system is identical to an inverted pendulum system with the buckling pole acting as a spring. The purpose of this paper is to study the influence of factors on the pole vaulting performance such as the ...

متن کامل

Vaulting optimality

The target article provokes three comments and one more general criticism. First, the reason it is not surprising that "[the optimality heuristic] is used most systematically and successful

متن کامل

An Enhanced Wu-Huberman Algorithm with Pole Point Selection Strategy

and Applied Analysis 3 for pole point selection. After that, we iteratively solve the Kirchhoff equation to perform clustering. Finally, we get the clustering result. In this paper, we consider only the 2community clustering case and will leave the case of k cluster problem into the future research.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Operations Research

سال: 1989

ISSN: 0030-364X,1526-5463

DOI: 10.1287/opre.37.1.172